Mimetic finite differences for elliptic problems
نویسندگان
چکیده
منابع مشابه
Mimetic Finite Differences for Elliptic Problems
We developed a mimetic finite difference method for solving elliptic equations with tensor coefficients on polyhedral meshes. The first-order convergence estimates in a mesh-dependent H norm are derived. Mathematics Subject Classification. 65N06, 65N12, 65N15, 65N30. Received December 5, 2007. Revised July 21, 2008. Published online December 5, 2008.
متن کاملA Mimetic Discretization of Elliptic Control Problems
In this paper we investigate the Mimetic Finite Difference method for the approximation of a constraint optimal control problem governed by an elliptic operator. A priori error estimates of the first order are derived in suitable discrete norms for both the control and the state variables. The theoretical results are confirmed by numerical experiments performed on a set of test cases selected f...
متن کاملMimetic Discretizations of Elliptic Control Problems
We investigate the performance of the Mimetic Finite Difference (MFD) method for the approximation of a constraint optimal control problem governed by an elliptic operator. Low-order and high-order mimetic discretizations are considered and a priori error estimates are derived, in a suitable discrete norm, for both the control and the state variables. A wide class of numerical experiments perfo...
متن کاملMixed Finite Elements for Elliptic Problems with Tensor Coeecients as Cell-centered Finite Diierences Mixed Finite Elements for Elliptic Problems with Tensor Coefficients as Cell-centered Finite Differences
We present an expanded mixed nite element approximation of second order elliptic problems containing a tensor coeecient. The mixed method is expanded in the sense that three variables are explicitly approximated, namely, the scalar unknown, the negative of its gradient, and its ux (the tensor coeecient times the negative gradient). The resulting linear system is a saddle point problem. In the c...
متن کاملhp - Finite Elements for Elliptic Eigenvalue Problems
Convergence rates for finite element discretisations of elliptic eigenvalue problems in the literature usually are of the form: If the mesh width h is fine enough then the eigenvalues resp. eigenfunctions converge at some well-defined rate. In this paper, we will determine the maximal mesh width h0 — more precisely the minimal dimension of a finite element space — so that the asymptotic converg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2008
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an:2008046